Robustness of Operational Matrices of Differentiation for Solving State-Space Analysis and Optimal Control Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robustness of Operational Matrices of Differentiation for Solving State-Space Analysis and Optimal Control Problems

and Applied Analysis 3 subject to the nonlinear system (8), for Q ∈ R, R ∈ Rm×m positive semidefinite and positive definite matrices, respectively. Since the performance index (9) is convex, the following extreme necessary conditions are also sufficient for optimality [28]: ?̇? = f (t, x) + g (t, x) u ∗ , ̇ λ = −H x (x, u ∗ , λ) , u ∗ = arg min u H(x, u, λ) , x (t 0 ) = x 0 , λ (t f ) = 0, (10) w...

متن کامل

New operational matrix for solving a class of optimal control problems with Jumarie’s modified Riemann-Liouville fractional derivative

In this paper, we apply spectral method based on the Bernstein polynomials for solving a class of optimal control problems with Jumarie’s modified Riemann-Liouville fractional derivative. In the first step, we introduce the dual basis and operational matrix of product based on the Bernstein basis. Then, we get the Bernstein operational matrix for the Jumarie’s modified Riemann-Liouville fractio...

متن کامل

Generalized B-spline functions ‎method‎‎ for solving optimal control problems

‎In this paper we introduce a numerical approach that solves optimal control problems (OCPs) ‎using collocation methods‎. ‎This approach is based upon B-spline functions‎. ‎The derivative matrices between any two families of B-spline functions are utilized to‎ ‎reduce the solution of OCPs to the solution of nonlinear optimization problems‎. ‎Numerical experiments confirm our heoretical findings‎.

متن کامل

A Method for Solving Optimal Control Problems Using Genetic Programming

This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.

متن کامل

Solving optimal control problems by PSO-SVM

The optimal control of problem is about finding a control law for a given system such that a certain optimality criterion is achieved. Methods of solving the optimal control problems are divided into direct methods and mediated methods (through other equations). In this paper, the PSO- SVM indirect method is used to solve a class of optimal control problems. In this paper, we try to determine t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abstract and Applied Analysis

سال: 2013

ISSN: 1085-3375,1687-0409

DOI: 10.1155/2013/535979